On a Reduced Load Equivalence Under Heavy Tail Assumptions
نویسندگان
چکیده
We propose a general framework for obtaining asymptotic distributional bounds on the stationary backlogW12 in a bu er fed by a combined uid process A1+A2 and drained at a constant rate c. The uid process A1 is an (independent) on-o source with average and peak rates 1 and r1, respectively, and with distribution G for the activity periods. The uid process A2 of average rate 2 is arbitrary but independent of A1. These bounds are used to identify subexponential distributions G and fairly general uid processes A2 such that the asymptotic equivalence P W12 > x P W1 2 > x (x!1) holds under the stability condition 1+ 2 < c and under the non-triviality condition c 2 < r1. The stationary backlogW A1;c 2 in these asymptotics results from feeding source A1 into a bu er drained at reduced rate c 2. This reduced load asymptotic equivalence extends to a larger class of distributions G a result obtained by Jelenkovic and Lazar [18] in the case when G belongs to the class of regular intermediate varying distributions. This work was performed in part while R. Agrawal was visiting INRIA during the Spring of 1997 and while A. M. Makowski was visiting INRIA during the academic year 1997/98. The work of this author was funded in part by the National Science Foundation under grant NCR-93-05018. The work of this author was supported partially through NSF Grant NSFD CDR-88-03012, NASA Grant NAGW77S, the Army Research Laboratory under Cooperative Agreement No. DAAL01-96-2-0002 and through the Maryland Procurement O ce under Grant No. MDA90497C3015.
منابع مشابه
Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
We analyze the behavior of Generalized Processor Sharing (GPS) queues with heavy-tailed service times. We compute the exact tail asymptotics of the stationary workload of an individual class and give new conditions for reduced-load equivalence and induced burstiness to hold. We also show that both phenomena can occur simultaneously. Our proofs rely on the single big event theorem and new fluid ...
متن کاملProbability , Networks and Algorithms Reduced - load equivalence for queues with Gaussian input
In this note, we consider a queue fed by a number of independent heterogeneous Gaussian sources. We study under what conditions a reduced load equivalence holds, i.e., when a subset of the sources becomes asymptotically dominant as the buffer size increases. For this, recent results on extremes of Gaussian processes are combined with de Haan theory. We explain how the results of this note relat...
متن کاملExact Asymptotics for Fluid Queues Fed by Multiple Heavy-tailed On–off Flows by Bert Zwart, Sem Borst
We consider a fluid queue fed by multiple On–Off flows with heavytailed (regularly varying) On periods. Under fairly mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a reduced system. The reduced system consists of a “dominant” subset of the flows, with the original service rate subtracted by the mean rate of the other flows. We describe how a do...
متن کاملAsymptotic behavior of Generalized Processor Sharing queues under subexponential hypothesis
Abstract: We analyze the behavior of Generalized Processor Sharing (GPS) queues with heavy-tailed service times. We compute the exact tail asymptotics of the stationary workload of an individual class and give new conditions for reduced-load equivalence and induced burstiness to hold. We also show that both phenomena can occur simultaneously. Our proofs rely on the single big event theorem and ...
متن کاملExact Queueing Asymptotics for Multiple Heavy-Tailed On-Off Flows
We consider a fluid queue fed by multiple On-Off flows with heavy-tailed (regularly varying) On-periods. Under fairly mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a reduced system. The reduced system consists of a ‘dominant’ subset of the flows, with the original service rate subtracted by the mean rate of the other flows. We describe how a d...
متن کامل